The Distribution of Patterns in Random Trees
نویسندگان
چکیده
منابع مشابه
The Distribution of Patterns in Random Trees
Let Tn denote the set of unrooted labeled trees of size n and let M be a particular (finite, unlabeled) tree. Assuming that every tree of Tn is equally likely, it is shown that the limiting distribution as n goes to infinity of the number of occurrences of M as an induced subtree is asymptotically normal with mean value and variance asymptotically equivalent to μn and σn, respectively, where th...
متن کاملLimit distribution of the degrees in scaled attachment random recursive trees
We study the limiting distribution of the degree of a given node in a scaled attachment random recursive tree, a generalized random recursive tree, which is introduced by Devroye et. al (2011). In a scaled attachment random recursive tree, every node $i$ is attached to the node labeled $lfloor iX_i floor$ where $X_0$, $ldots$ , $X_n$ is a sequence of i.i.d. random variables, with support in [0,...
متن کاملanalyzing patterns of classroom interaction in efl classrooms in iran
با به کار گیری روش گفتما ن شنا سی در تحقیق حا ضر گفتا ر میا ن آموزگا را ن و زبا ن آموزا ن در کلا سهای زبا ن انگلیسی در ایرا ن مورد بررسی قرار گرفت. ا هداف تحقیق عبا رت بودند از: الف) شنا سا ئی سا ختارهای ارتبا ط گفتا ری میا ن معلمین و زبا ن آموزا ن ب) بررسی تا ثیر نقش جنسیت دبیرا ن و زبا ن آموزان بر سا ختا رهای ارتبا ط گفتا ری میا ن آنها پ) مشخص کردن اینکه آ یا آموزگاران غا لب بر این ارتبا ط گف...
The degree distribution of random k-trees
A power law degree distribution is established for a graph evolution model based on the graph class of k-trees. This k-tree-based graph process can be viewed as an idealized model that captures some characteristics of the preferential attachment and copying mechanisms that existing evolving graph processes fail to model due to technical obstacles. The result also serves as a further cautionary ...
متن کاملBranches in random recursive k-ary trees
In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2008
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548307008425